31![Approximating Fault-Tolerant Domination in General Graphs Klaus-Tycho Förster ETH Zurich – Distributed Computing – www.disco.ethz.ch Approximating Fault-Tolerant Domination in General Graphs Klaus-Tycho Förster ETH Zurich – Distributed Computing – www.disco.ethz.ch](https://www.pdfsearch.io/img/58e2510cf912b76b66d24d274cf2a8d5.jpg) | Add to Reading ListSource URL: www.tik.ee.ethz.chLanguage: English - Date: 2015-05-18 12:16:33
|
---|
32![Approximating Fault-Tolerant Domination in General Graphs Klaus-Tycho Foerster∗ Abstract In this paper we study the NP-complete problem of finding small k-dominating sets in general graphs, which allow k − 1 nodes to Approximating Fault-Tolerant Domination in General Graphs Klaus-Tycho Foerster∗ Abstract In this paper we study the NP-complete problem of finding small k-dominating sets in general graphs, which allow k − 1 nodes to](https://www.pdfsearch.io/img/9fe4aef7c46dffa4565cce8970b94382.jpg) | Add to Reading ListSource URL: www.tik.ee.ethz.chLanguage: English - Date: 2015-05-18 12:16:23
|
---|
33![A new characterization of Pk -free graphs Eglantine Camby Universit´e Libre de Bruxelles D´epartement de Math´ematique Boulevard du Triomphe, 1050 Brussels, Belgium A new characterization of Pk -free graphs Eglantine Camby Universit´e Libre de Bruxelles D´epartement de Math´ematique Boulevard du Triomphe, 1050 Brussels, Belgium](https://www.pdfsearch.io/img/d20cfa1fb0358fe52c8dc995152d591d.jpg) | Add to Reading ListSource URL: www.zaik.uni-koeln.deLanguage: English - Date: 2015-02-09 05:54:36
|
---|
34![On Approximation Complexity of Edge Dominating Set Problem in Dense Graphs Richard Schmied∗ Claus Viehmann† On Approximation Complexity of Edge Dominating Set Problem in Dense Graphs Richard Schmied∗ Claus Viehmann†](https://www.pdfsearch.io/img/5e3a1c985ac768294db9d78c745ef1ac.jpg) | Add to Reading ListSource URL: theory.cs.uni-bonn.deLanguage: English - Date: 2011-06-03 08:54:09
|
---|
35![Hitting Set Algorithms for Fast Data Recovery in the Face of Geographic Correlated Attacks Alon Efrat Esther Ezra Hitting Set Algorithms for Fast Data Recovery in the Face of Geographic Correlated Attacks Alon Efrat Esther Ezra](https://www.pdfsearch.io/img/6295f4be9ce4415695a43c839618f243.jpg) | Add to Reading ListSource URL: www.cims.nyu.eduLanguage: English - Date: 2013-07-29 14:22:26
|
---|
36![Seminar on Algorithms and Geometry 2014B – Problem Set 3 Robert Krauthgamer May 15, 2014 We discussed in class low-distortion metric embeddings, and in particular a probabilistic embedding into dominating trees. Seminar on Algorithms and Geometry 2014B – Problem Set 3 Robert Krauthgamer May 15, 2014 We discussed in class low-distortion metric embeddings, and in particular a probabilistic embedding into dominating trees.](https://www.pdfsearch.io/img/b3ef00ba17115b3eb794ecfb4135588c.jpg) | Add to Reading ListSource URL: www.wisdom.weizmann.ac.il- Date: 2014-05-15 11:57:38
|
---|
37![An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem Arash Asadpour∗ ‡ Michel X. Goemans† An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem Arash Asadpour∗ ‡ Michel X. Goemans†](https://www.pdfsearch.io/img/11a0cac517f47976cba418de6ffe7399.jpg) | Add to Reading ListSource URL: www.stanford.eduLanguage: English - Date: 2009-10-28 12:34:47
|
---|
38![Correlation Clustering and Two-edge-connected Augmentation for Planar Graphs Philip N. Klein1 , Claire Mathieu2,3 , and Hang Zhou3 1 Brown University, United States Correlation Clustering and Two-edge-connected Augmentation for Planar Graphs Philip N. Klein1 , Claire Mathieu2,3 , and Hang Zhou3 1 Brown University, United States](https://www.pdfsearch.io/img/2ed6a140d92c852c6c30661922eafb59.jpg) | Add to Reading ListSource URL: www.normalesup.orgLanguage: English - Date: 2015-03-16 13:08:36
|
---|
39![Local Distributed Decision∗ Pierre Fraigniaud† Amos Korman† David Peleg‡ Local Distributed Decision∗ Pierre Fraigniaud† Amos Korman† David Peleg‡](https://www.pdfsearch.io/img/448da6ee2f3fd26231bb3f35e9292977.jpg) | Add to Reading ListSource URL: www.liafa.jussieu.frLanguage: English - Date: 2011-10-30 17:16:12
|
---|
40![Better bounds for matchings in the streaming model Michael Kapralov∗ arXiv:1206.2269v2 [cs.DS] 26 JulDecember 6, 2013 Better bounds for matchings in the streaming model Michael Kapralov∗ arXiv:1206.2269v2 [cs.DS] 26 JulDecember 6, 2013](https://www.pdfsearch.io/img/f68c5556ad984d3c18e7a46eacfa68df.jpg) | Add to Reading ListSource URL: arxiv.orgLanguage: English - Date: 2013-12-06 12:53:09
|
---|